Behavioral Cartography of Timed Automata
نویسندگان
چکیده
We aim at finding a set of timing parameters for which a given timed automaton has a “good” behavior. We present here a novel approach based on the decomposition of the parametric space into behavioral tiles, i.e., sets of parameter valuations for which the behavior of the system is uniform. This gives us a behavioral cartography according to the values of the parameters. It is then straightforward to partition the space into a “good” and a “bad” subspace, according to the behavior of the tiles. We extend this method to probabilistic systems, allowing to decompose the parametric space into tiles for which the minimal (resp. maximal) probability of reaching a given location is uniform. An implementation has been made, and experiments successfully conducted.
منابع مشابه
IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata
We present here IMITATOR II, a new version of IMITATOR, a tool implementing the “inverse method” for parametric timed automata: given a reference valuation of the parameters, it synthesizes a constraint such that, for any valuation satisfying this constraint, the system behaves the same as under the reference valuation in terms of traces, i.e., alternating sequences of locations and actions. IM...
متن کاملOn Properties of the Inverse Method: Commutation of Instanciation and Full Covering of the Behavioral Cartography
When one performs an Inverse Method [5] on a Parametric Timed Automata [1] over an instance π0, one can instantiate some parameters at the very beginning of the analysis or at the end, with a restriction of the constraint K0 obtained in order to get a constraint over a subset of the parameters. In this report, we show that the results of either methods are the same. We present a theoretical pro...
متن کاملAn Extension of the Inverse Method to Probabilistic Timed Automata
Probabilistic timed automata can be used to model systems in which probabilistic and timing behaviour coexist. Verification of probabilistic timed automata models is generally performed with regard to a single reference valuation π0 of the timing parameters. Given such a parameter valuation, we present a method for obtaining automatically a constraint K0 on timing parameters for which the reach...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملAn InverseMethod for the Synthesis of Timing Parameters in Concurrent Systems
This thesis proposes a novel approach for the synthesis of delays for timed systems. When verifying a real-time system, e.g., a hardware device or a communication protocol, it is important to check that not only the functional but also the timed behavior is correct. This correctness depends on the values of the delays of internal operations and of the environment. Formal verification methods gu...
متن کامل